Two-Trees Optimal T-Join and Integral Packing of T-Cuts

On the integral 4-packing of T-cuts

Let C = (V, E) be an undirected graph, w : E + Z’ a weight function and T c V an even subset of vertices from G. A T-cut is an edge-cut set which divides T into two odd sets. For ( Tj = 4 Seymour gave a good characterization of the graphs for which there exists a maximum packing of T-cuts that is integral. Based on Seymour’s characterization we provide a simple 0(n3m + PI”&) algorithm for incre...

On Packing T-Cuts

A short proof of a difficult theorem of P.D. Seymour on grafts with the max-flow min-cut property is given.

@bullet Technion -israel Institute of Technology Computer Science Department 2-trees Op-timal T-join and Integral Packing of T-cuts

On shortest T-joins and packing T-cuts

Let G be an undirected connected graph. For each u E V(G), the node set of G, and each Fc E(G), the edge set of G, we define dF(u) to be the number of edges in F incident with u. If T& V(G), then we call a set Fs E(G) a T-join if T= {UE V(G)(d,( ) o is odd}. Throughout this paper we shall always assume ( T ( to be even. We denote the minimum cardinality of a T-join in G by z,(G). For UG V(G) we...

Parallel Generation of t-ary Trees

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...